Using Coreference Links and Sentence Compression in Graph-based Summarization

نویسندگان

  • Iris Hendrickx
  • Wauter Bosma
چکیده

Recent years have shown that graphs are an adequate text representation model for summarization. For this years’ TAC update summarization challenge, we extended our graph-based summarization system with coreference relations and sentence compression. Our results show that using coreference relations did not result in a significant performance gain; sentence compression had a negative effect on performance. We participated in the opinion summarization task with our base graph-based system. The measured performance of our opinion summarization system was competitive with respect to responsiveness, and poor with respect to linguistic quality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Summaries Using Sentence Compression and Statistical Measures

In this paper, we propose a compression based multi-document summarization technique by incorporating word bigram probability and word co-occurrence measure. First we implemented a graph based technique to achieve sentence compression and information fusion. In the second step, we use hand-crafted rule based syntactic constraint to prune our compressed sentences. Finally we use probabilistic me...

متن کامل

UNIVERSITY OF BIRMINGHAM Automatic Documents Summarization Using Ontology based Methodologies

In this paper, we emphasize the need for conservingspace within sentences by introducing a Sentences SimplificationModule (SSM). The module is aimed to shorten the length ofsentences via either splitting or compression. We describe howthe module is integrated in a Wikipedia-based summarizationframework. We highlight the performance differences obtainedfrom introducing su...

متن کامل

Semantic Role Frames Graph-based Multidocument Summarization

Multi-document summarization is a process of automatic creation of a compressed version of the given collection of documents. Recently, the graph-based models and ranking algorithms have been extensively researched by the extractive document summarization community. While most work to date focuses on sentence-level relations in this paper we present graph model that emphasizes not only sentence...

متن کامل

Corefrence resolution with deep learning in the Persian Labnguage

Coreference resolution is an advanced issue in natural language processing. Nowadays, due to the extension of social networks, TV channels, news agencies, the Internet, etc. in human life, reading all the contents, analyzing them, and finding a relation between them require time and cost. In the present era, text analysis is performed using various natural language processing techniques, one ...

متن کامل

Corpus based coreference resolution for Farsi text

"Coreference resolution" or "finding all expressions that refer to the same entity" in a text, is one of the important requirements in natural language processing. Two words are coreference when both refer to a single entity in the text or the real world. So the main task of coreference resolution systems is to identify terms that refer to a unique entity. A coreference resolution tool could be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008